../out/fig-clauses-n100.ps

Source URL: www.lsi.upc.edu

• Constraint programming
• Local consistency
• Interleaving
• BCD

Proof Procedures for Separated Heap Abstractions Josh Berdine, Cristiano Calcagno, Peter O’Hearn 1 July, 2007 (Canada day) Part 0

Source URL: www.lsi.upc.edu

Proof-producing Congruence Closure Robert Nieuwenhuis? and Albert Oliveras?? Technical University of Catalonia, Jordi Girona 1, 08034 Barcelona, Spain www.lsi.upc.es/~roberto www.lsi.upc.es/~oliveras Abstract. Many appl

Source URL: www.lsi.upc.edu

• Mathematics
• Algebra
• Theoretical computer science
• Modular arithmetic
• Logic in computer science
• Congruence relation
• Equivalence
• Closure
• Rewriting
• Congruence lattice problem
• Congruence subgroup

Encoding First Order Proofs in SMT Jeremy Bongio, Cyrus Katrak, Hai Lin, Christopher Lynch, Eric McGregor and Yuefeng Tang

Source URL: www.lsi.upc.edu

• Logic
• Mathematics
• Automated theorem proving
• Formal languages
• Resolution
• Literal
• Regular expression
• Philosophy of mathematics
• (SAT
• -UNSAT)

SMT Techniques for Fast Predicate Abstraction Shuvendu K. Lahiri1 , Robert Nieuwenhuis2 , and Albert Oliveras2 1

Source URL: www.lsi.upc.edu

• Logic
• Mathematical logic
• Mathematics
• Predicate logic
• Propositional calculus
• Semantics
• Philosophical logic
• Satisfiability modulo theories
• Predicate
• Literal
• Well-formed formula
• Model checking

Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions⋆ Daniel Larraz, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio Universitat Polit`ecnica de Catalunya, Barcelona, Spain

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Computational complexity theory
• Mathematical logic
• Constraint programming
• Logic in computer science
• Electronic design automation
• Formal methods
• NP-complete problems
• Boolean satisfiability problem
• Satisfiability modulo theories
• Maximum satisfiability problem
• Local consistency

CC(X): Efficiently Combining Equalities and Solvable Theories without Canonizers Sylvain Conchon, Evelyne Contejean and Johannes Kanig ProVal Project Universit´e Paris Sud / CNRS / INRIA

Source URL: www.lsi.upc.edu

• Differentiation rules
• Number theory
• Polynomials
• Lie algebras
• Smooth functions

Speeding Up the Constraint-Based Method in Difference Logic ⋆ Lorenzo Candeago1, Daniel Larraz2, Albert Oliveras2, Enric Rodr´ıguez-Carbonell2, and Albert Rubio2 2

Source URL: www.lsi.upc.edu

• Mathematics
• Theoretical computer science
• Algebra
• Linear programming
• Formal methods
• Constraint programming
• Declarative programming
• Invariant
• Satisfiability modulo theories
• Linear inequality
• Inequality

Challenges in Satisfiability Modulo Theories Robert Nieuwenhuis, Albert Oliveras, Enric Rodr´ıguez-Carbonell, and Albert Rubio? Abstract. Here we give a short overview of the DPLL(T ) approach to Satisfiability Modulo

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematical logic
• Mathematics
• Formal methods
• Logic in computer science
• Automated theorem proving
• Constraint programming
• Electronic design automation
• Conflict-driven clause learning
• Satisfiability modulo theories
• Boolean satisfiability problem
• Unit propagation

The Barcelogic SMT Solver (Tool Paper)? Miquel Bofill† , Robert Nieuwenhuis? , Albert Oliveras? , Enric Rodr´ıguez-Carbonell? and Albert Rubio? †

Source URL: www.lsi.upc.edu

• Theoretical computer science
• Mathematics
• Computational complexity theory
• Logic in computer science
• Constraint programming
• Electronic design automation
• Formal methods
• NP-complete problems
• Satisfiability modulo theories
• Boolean satisfiability problem
• Solver
• Maximum satisfiability problem